Exact Solution of Permuted Submodular MinSum Problems
نویسنده
چکیده
In this work we show, that for each permuted submodular MinSum problem (Energy Minimization Task) the corresponding submodular MinSum problem can be found in polynomial time. It follows, that permuted submodular MinSum problems are exactly solvable by transforming them into corresponding submodular tasks followed by applying standart approaches (e.g. using MinCutMaxFlow based techniques).
منابع مشابه
Transforming an Arbitrary Minsum Problem into a Binary One
In this report we show, that an arbitrary MinSum problem (i.e. a MinSum problem with an arbitrary finite set of states) can be adequately transformed into a binary one (i.e. into a MinSum problem with only two states). Consequently all known results for binary MinSum problems can be easily extended to the general case. For instance it gives the possibility to solve exactly submodular MinSum pro...
متن کاملValuated matroid-based algorithm for submodular welfare problem
An algorithm for the submodular welfare problem is proposed based on the theory of discrete convex analysis. The proposed algorithm is a heuristic method built upon the valuated matroid partition algorithms, and gives the exact optimal solution for a reasonable subclass of submodular welfare problems. The algorithm has a guaranteed approximation ratio for a special case. Computational results s...
متن کاملCombining Minsum And Minmax: A Goal Programming Approach
A number of methods for multiple-objective optimization problems (MOP) give as solution to MOP the set of optimal solutions for some single-objective optimization problems associated with it. Well-known examples of these single-objective optimization problems are the minsum and the minmax. In this note, we propose a new parametric single-objective optimization problem associated with MOP by mea...
متن کاملHeuristic solution approaches for the maximum minsum dispersion problem
The Maximum Minsum Dispersion Problem (Max-Minsum DP) is a strongly NP-Hard problem that belongs to the family of equitable dispersion problems. When dealing with dispersion, the operations research literature has focused on optimizing efficiency-based objectives while neglecting, for the most part, measures of equity. The most common efficiency-based functions are the sum of the inter-element ...
متن کاملProvable Submodular Minimization via Fujishige-Wolfe’s Algorithm∗
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [10, 11]. However, these algorithms are typically not practical. In 1976, Wolfe [22] proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fu...
متن کامل